An Algebraic Approach to Multiple Context-Free Grammars
نویسندگان
چکیده
We define an algebraic structure, Paired Complete Idempotent Semirings (pcis), which are appropriate for defining a denotational semantics for multiple context-free grammars of dimension 2 (2-mcfg). We demonstrate that homomorphisms of this structure will induce wellbehaved morphisms of the grammar, and generalize the syntactic concept lattice from context-free grammars to the 2-mcfg case. We show that this lattice is the unique minimal structure that will interpret the grammar faithfully and that therefore 2-mcfgs without mergeable nonterminals will have nonterminals that correspond to elements of this structure.
منابع مشابه
Logical Grammars, Logical Theories
Residuated lattices form one of the theoretical backbones of the Lambek Calculus as the standard free models. They also appear in grammatical inference as the syntactic concept lattice, an algebraic structure canonically defined for every language L based on the lattice of all distributionally definable subsets of strings. Recent results show that it is possible to build representations, such a...
متن کاملAlgebraic dynamic programming for multiple context-free grammars
We present theoretical foundations, and a practical implementation, that makes the method of Algebraic Dynamic Programming available for Multiple ContextFree Grammars. This allows to formulate optimization problems, where the search space can be described by such grammars, in a concise manner and solutions may be obtained efficiently. This improves on the previous state of the art which require...
متن کاملAlgebraic and Combinatorial Properties of Common RNA Pseudoknot Classes with Applications
Predicting RNA structures with pseudoknots in general is an NP-complete problem. Accordingly, several authors have suggested subclasses that provide polynomial time prediction algorithms by allowing (respectively, disallowing) certain structural motives. In this article, we introduce a unifying algebraic view on most of these classes. That way it becomes possible to find linear time recognition...
متن کاملPolymorphic Syntax Definition
Context-free grammars can be used in algebraic speciication instead of rst-order signatures to deene the structure of algebras. The rigidity of these rst-order structures enforces a choice between strongly typed structures with little gener-icity or generic operations over untyped structures. Two-level signatures provide a better balance between genericity and typing. Two-level grammars are the...
متن کاملEquivalences and Transformations Systems-applications to Recursive Program Schemes and Grammars* of Regular
This work presents a unified theory of recursive program schemes, context-free grammars, grammars on arbitrary algebraic structures and, in fact, recursive definitions of all kind by means of regular systems. The equivalences of regular systems associated with either all their solutions or their least solutions (in all domains of appropriate type satisfying a set of algebraic laws expressed by ...
متن کامل